Selection of top-K influential users based on radius-neighborhood degree, multi-hops distance and selection threshold
نویسندگان
چکیده
منابع مشابه
Distance-based adaptive k-neighborhood selection
The k-nearest neighbor classifier follows a simple, yet powerful algorithm: collect the k data points closest to an unlabeled instance, according to a given distance measure, and use them to predict that instance’s label. The two components, the parameter k governing the size of used neighborhood, and the distance measure, essentially determine success or failure of the classifier. In this work...
متن کاملTop-k Most Influential Location Selection
We propose and study a new type of facility location selection query, the top-k most influential location selection query. Given a set M of customers and a set F of existing facilities, this query finds k locations from a set C of candidate locations with the largest influence values, where the influence of a candidate location c (c ∈ C) is defined as the number of customers in M who are the re...
متن کاملProcessing of Top-K Most Influential Location Selection Queries
Facility location selection queries help to evaluate the popularity of different facility locations for a to-be-added facility. Such queries have wide applications in marketing and decision support systems. In this report, we propose and investigate a new type of queries aiming to retrieve the top-k most influential locations from a candidate set in a given context of customers and existing fac...
متن کاملInterval MULTIMOORA method with target values of attributes based on interval distance and preference degree: biomaterials selection
A target-based MADM method covers beneficial and non-beneficial attributes besides target values for some attributes. Such techniques are considered as the comprehensive forms of MADM approaches. Target-based MADM methods can also be used in traditional decision-making problems in which beneficial and non-beneficial attributes only exist. In many practical selection problems, some attributes ha...
متن کاملTop-k Selection based on Adaptive Sampling of Noisy Preferences
We consider the problem of reliably selecting an optimal subset of fixed size from a given set of choice alternatives, based on noisy information about the quality of these alternatives. Problems of similar kind have been tackled by means of adaptive sampling schemes called racing algorithms. However, in contrast to existing approaches, we do not assume that each alternative is characterized by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Big Data
سال: 2018
ISSN: 2196-1115
DOI: 10.1186/s40537-018-0137-4